Termination w.r.t. Q proof of /tmp/tmp4fw5Yr/thiemann37.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

Q is empty.

The TRS is overlay and locally confluent. By [19] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

IF1(false, x, y, c, i, j) → SIZE(j)
REACH(x, y, c, i, j) → EQ(x, y)
IF1(false, x, y, c, i, j) → LE(c, size(j))
LE(s(x), s(y)) → LE(x, y)
IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j)
EQ(s(x), s(y)) → EQ(x, y)
REACHABLE(x, y, i) → REACH(x, y, 0, i, i)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → OR(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))
IF2(true, x, y, c, edge(u, v, i), j) → AND(eq(x, u), reach(v, y, s(c), j, j))
IF2(true, x, y, c, edge(u, v, i), j) → EQ(x, u)
REACH(x, y, c, i, j) → IF1(eq(x, y), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)
SIZE(edge(x, y, i)) → SIZE(i)

The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

IF1(false, x, y, c, i, j) → SIZE(j)
REACH(x, y, c, i, j) → EQ(x, y)
IF1(false, x, y, c, i, j) → LE(c, size(j))
LE(s(x), s(y)) → LE(x, y)
IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j)
EQ(s(x), s(y)) → EQ(x, y)
REACHABLE(x, y, i) → REACH(x, y, 0, i, i)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → OR(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))
IF2(true, x, y, c, edge(u, v, i), j) → AND(eq(x, u), reach(v, y, s(c), j, j))
IF2(true, x, y, c, edge(u, v, i), j) → EQ(x, u)
REACH(x, y, c, i, j) → IF1(eq(x, y), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)
SIZE(edge(x, y, i)) → SIZE(i)

The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 4 SCCs with 7 less nodes.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE(s(x), s(y)) → LE(x, y)

The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [15] we can delete all non-usable rules [17] from R.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE(s(x), s(y)) → LE(x, y)

R is empty.
The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

LE(s(x), s(y)) → LE(x, y)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LE(s(x), s(y)) → LE(x, y)
The graph contains the following edges 1 > 1, 2 > 2

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SIZE(edge(x, y, i)) → SIZE(i)

The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SIZE(edge(x, y, i)) → SIZE(i)

R is empty.
The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

SIZE(edge(x, y, i)) → SIZE(i)

From the DPs we obtained the following set of size-change graphs:

SIZE(edge(x, y, i)) → SIZE(i)
The graph contains the following edges 1 > 1

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

EQ(s(x), s(y)) → EQ(x, y)

The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

EQ(s(x), s(y)) → EQ(x, y)

R is empty.
The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

EQ(s(x), s(y)) → EQ(x, y)

From the DPs we obtained the following set of size-change graphs:

EQ(s(x), s(y)) → EQ(x, y)
The graph contains the following edges 1 > 1, 2 > 2

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

Q DP problem:
The TRS P consists of the following rules:

IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(x, y, c, i, j) → IF1(eq(x, y), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)
or(true, y) → true
or(false, y) → y
and(true, y) → y
and(false, y) → false
size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
reachable(x, y, i) → reach(x, y, 0, i, i)
reach(x, y, c, i, j) → if1(eq(x, y), x, y, c, i, j)
if1(true, x, y, c, i, j) → true
if1(false, x, y, c, i, j) → if2(le(c, size(j)), x, y, c, i, j)
if2(false, x, y, c, i, j) → false
if2(true, x, y, c, empty, j) → false
if2(true, x, y, c, edge(u, v, i), j) → or(if2(true, x, y, c, i, j), and(eq(x, u), reach(v, y, s(c), j, j)))

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

Q DP problem:
The TRS P consists of the following rules:

IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(x, y, c, i, j) → IF1(eq(x, y), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

We have to consider all minimal (P,Q,R)-chains.
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.

or(true, x0)
or(false, x0)
and(true, x0)
and(false, x0)
reachable(x0, x1, x2)
reach(x0, x1, x2, x3, x4)
if1(true, x0, x1, x2, x3, x4)
if1(false, x0, x1, x2, x3, x4)
if2(false, x0, x1, x2, x3, x4)
if2(true, x0, x1, x2, empty, x3)
if2(true, x0, x1, x2, edge(x3, x4, x5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

Q DP problem:
The TRS P consists of the following rules:

IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(x, y, c, i, j) → IF1(eq(x, y), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule REACH(x, y, c, i, j) → IF1(eq(x, y), x, y, c, i, j) we obtained the following new rules:

REACH(z4, z1, s(z2), z6, z6) → IF1(eq(z4, z1), z4, z1, s(z2), z6, z6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

Q DP problem:
The TRS P consists of the following rules:

REACH(z4, z1, s(z2), z6, z6) → IF1(eq(z4, z1), z4, z1, s(z2), z6, z6)
IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule IF1(false, x, y, c, i, j) → IF2(le(c, size(j)), x, y, c, i, j) we obtained the following new rules:

IF1(false, z0, z1, s(z2), z3, z3) → IF2(le(s(z2), size(z3)), z0, z1, s(z2), z3, z3)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

Q DP problem:
The TRS P consists of the following rules:

REACH(z4, z1, s(z2), z6, z6) → IF1(eq(z4, z1), z4, z1, s(z2), z6, z6)
IF1(false, z0, z1, s(z2), z3, z3) → IF2(le(s(z2), size(z3)), z0, z1, s(z2), z3, z3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule REACH(z4, z1, s(z2), z6, z6) → IF1(eq(z4, z1), z4, z1, s(z2), z6, z6) at position [0] we obtained the following new rules:

REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
REACH(0, 0, s(y2), y3, y3) → IF1(true, 0, 0, s(y2), y3, y3)
REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

REACH(0, 0, s(y2), y3, y3) → IF1(true, 0, 0, s(y2), y3, y3)
REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF1(false, z0, z1, s(z2), z3, z3) → IF2(le(s(z2), size(z3)), z0, z1, s(z2), z3, z3)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF1(false, z0, z1, s(z2), z3, z3) → IF2(le(s(z2), size(z3)), z0, z1, s(z2), z3, z3)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By narrowing [15] the rule IF1(false, z0, z1, s(z2), z3, z3) → IF2(le(s(z2), size(z3)), z0, z1, s(z2), z3, z3) at position [0] we obtained the following new rules:

IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(s(y2), s(size(x2))), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2))
IF1(false, y0, y1, s(y2), empty, empty) → IF2(le(s(y2), 0), y0, y1, s(y2), empty, empty)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF1(false, y0, y1, s(y2), empty, empty) → IF2(le(s(y2), 0), y0, y1, s(y2), empty, empty)
REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(s(y2), s(size(x2))), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2))
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 1 less node.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(s(y2), s(size(x2))), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2))
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By rewriting [15] the rule IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(s(y2), s(size(x2))), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) at position [0] we obtained the following new rules:

IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(y2, size(x2)), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2))

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

Q DP problem:
The TRS P consists of the following rules:

IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(y2, size(x2)), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2))
REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By instantiating [15] the rule IF1(false, y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) → IF2(le(y2, size(x2)), y0, y1, s(y2), edge(x0, x1, x2), edge(x0, x1, x2)) we obtained the following new rules:

IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule REACH(s(x0), 0, s(y2), y3, y3) → IF1(false, s(x0), 0, s(y2), y3, y3) we obtained the following new rules:

REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j)
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule IF2(true, x, y, c, edge(u, v, i), j) → IF2(true, x, y, c, i, j) we obtained the following new rules:

IF2(true, x0, x1, x2, edge(x3, x4, edge(y_3, y_4, y_5)), x6) → IF2(true, x0, x1, x2, edge(y_3, y_4, y_5), x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF2(true, x0, x1, x2, edge(x3, x4, edge(y_3, y_4, y_5)), x6) → IF2(true, x0, x1, x2, edge(y_3, y_4, y_5), x6)
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule IF2(true, x, y, c, edge(u, v, i), j) → REACH(v, y, s(c), j, j) we obtained the following new rules:

IF2(true, x0, 0, x2, edge(x3, s(y_0), x5), edge(y_2, y_3, y_4)) → REACH(s(y_0), 0, s(x2), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF2(true, x0, s(y_1), x2, edge(x3, s(y_0), x5), x6) → REACH(s(y_0), s(y_1), s(x2), x6, x6)
IF2(true, x0, s(y_0), x2, edge(x3, 0, x5), x6) → REACH(0, s(y_0), s(x2), x6, x6)

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

Q DP problem:
The TRS P consists of the following rules:

IF2(true, x0, 0, x2, edge(x3, s(y_0), x5), edge(y_2, y_3, y_4)) → REACH(s(y_0), 0, s(x2), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
IF2(true, x0, x1, x2, edge(x3, x4, edge(y_3, y_4, y_5)), x6) → IF2(true, x0, x1, x2, edge(y_3, y_4, y_5), x6)
REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3)
IF2(true, x0, s(y_0), x2, edge(x3, 0, x5), x6) → REACH(0, s(y_0), s(x2), x6, x6)
IF2(true, x0, s(y_1), x2, edge(x3, s(y_0), x5), x6) → REACH(s(y_0), s(y_1), s(x2), x6, x6)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule REACH(0, s(x0), s(y2), y3, y3) → IF1(false, 0, s(x0), s(y2), y3, y3) we obtained the following new rules:

REACH(0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, 0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

Q DP problem:
The TRS P consists of the following rules:

IF2(true, x0, 0, x2, edge(x3, s(y_0), x5), edge(y_2, y_3, y_4)) → REACH(s(y_0), 0, s(x2), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3)
IF2(true, x0, x1, x2, edge(x3, x4, edge(y_3, y_4, y_5)), x6) → IF2(true, x0, x1, x2, edge(y_3, y_4, y_5), x6)
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, 0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF2(true, x0, s(y_1), x2, edge(x3, s(y_0), x5), x6) → REACH(s(y_0), s(y_1), s(x2), x6, x6)
IF2(true, x0, s(y_0), x2, edge(x3, 0, x5), x6) → REACH(0, s(y_0), s(x2), x6, x6)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
By forward instantiating [14] the rule REACH(s(x0), s(x1), s(y2), y3, y3) → IF1(eq(x0, x1), s(x0), s(x1), s(y2), y3, y3) we obtained the following new rules:

REACH(s(x0), s(x1), s(x2), edge(y_4, y_5, y_6), edge(y_4, y_5, y_6)) → IF1(eq(x0, x1), s(x0), s(x1), s(x2), edge(y_4, y_5, y_6), edge(y_4, y_5, y_6))

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ MNOCProof

Q DP problem:
The TRS P consists of the following rules:

REACH(s(x0), s(x1), s(x2), edge(y_4, y_5, y_6), edge(y_4, y_5, y_6)) → IF1(eq(x0, x1), s(x0), s(x1), s(x2), edge(y_4, y_5, y_6), edge(y_4, y_5, y_6))
IF2(true, x0, 0, x2, edge(x3, s(y_0), x5), edge(y_2, y_3, y_4)) → REACH(s(y_0), 0, s(x2), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
IF2(true, x0, x1, x2, edge(x3, x4, edge(y_3, y_4, y_5)), x6) → IF2(true, x0, x1, x2, edge(y_3, y_4, y_5), x6)
REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
REACH(0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, 0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF2(true, x0, s(y_0), x2, edge(x3, 0, x5), x6) → REACH(0, s(y_0), s(x2), x6, x6)
IF2(true, x0, s(y_1), x2, edge(x3, s(y_0), x5), x6) → REACH(s(y_0), s(y_1), s(x2), x6, x6)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

The set Q consists of the following terms:

eq(0, 0)
eq(0, s(x0))
eq(s(x0), 0)
eq(s(x0), s(x1))
size(empty)
size(edge(x0, x1, x2))
le(0, x0)
le(s(x0), 0)
le(s(x0), s(x1))

We have to consider all minimal (P,Q,R)-chains.
We use the modular non-overlap check [17] to decrease Q to the empty set.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ QDP

              ↳ QDP

              ↳ QDP

              ↳ QDP

                ↳ UsableRulesProof

                  ↳ QDP

                    ↳ QReductionProof

                      ↳ QDP

                        ↳ Instantiation

                          ↳ QDP

                            ↳ Instantiation

                              ↳ QDP

                                ↳ Narrowing

                                  ↳ QDP

                                    ↳ DependencyGraphProof

                                      ↳ QDP

                                        ↳ Narrowing

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ QDP

                                                ↳ Rewriting

                                                  ↳ QDP

                                                    ↳ Instantiation

                                                      ↳ QDP

                                                        ↳ ForwardInstantiation

                                                          ↳ QDP

                                                            ↳ ForwardInstantiation

                                                              ↳ QDP

                                                                ↳ ForwardInstantiation

                                                                  ↳ QDP

                                                                    ↳ ForwardInstantiation

                                                                      ↳ QDP

                                                                        ↳ ForwardInstantiation

                                                                          ↳ QDP

                                                                            ↳ MNOCProof

                                                                              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

IF2(true, x0, 0, x2, edge(x3, s(y_0), x5), edge(y_2, y_3, y_4)) → REACH(s(y_0), 0, s(x2), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
REACH(s(x0), s(x1), s(x2), edge(y_4, y_5, y_6), edge(y_4, y_5, y_6)) → IF1(eq(x0, x1), s(x0), s(x1), s(x2), edge(y_4, y_5, y_6), edge(y_4, y_5, y_6))
IF2(true, x0, x1, x2, edge(x3, x4, edge(y_3, y_4, y_5)), x6) → IF2(true, x0, x1, x2, edge(y_3, y_4, y_5), x6)
IF1(false, s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z2, size(x5)), s(z0), s(z1), s(z2), edge(x3, x4, x5), edge(x3, x4, x5))
REACH(0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, 0, s(x0), s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
REACH(s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4)) → IF1(false, s(x0), 0, s(x1), edge(y_2, y_3, y_4), edge(y_2, y_3, y_4))
IF1(false, s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), s(z0), 0, s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF1(false, 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5)) → IF2(le(z1, size(x5)), 0, s(z0), s(z1), edge(x3, x4, x5), edge(x3, x4, x5))
IF2(true, x0, s(y_1), x2, edge(x3, s(y_0), x5), x6) → REACH(s(y_0), s(y_1), s(x2), x6, x6)
IF2(true, x0, s(y_0), x2, edge(x3, 0, x5), x6) → REACH(0, s(y_0), s(x2), x6, x6)

The TRS R consists of the following rules:

size(empty) → 0
size(edge(x, y, i)) → s(size(i))
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
eq(0, 0) → true
eq(0, s(x)) → false
eq(s(x), 0) → false
eq(s(x), s(y)) → eq(x, y)

Q is empty.
We have to consider all (P,Q,R)-chains.